A Provably Secure Strong PUF Based on LWE: Construction and Implementation

We construct a strong physical unclonable function (PUF) with provable security against machine learning (ML) attacks on both classical and quantum computers. The is guaranteed by the cryptographic hardness of decryption functions public-key cryptosystems, learning-with-errors (LWE) problem defined integer lattices. call our construction lattice PUF. PUF physically obfuscated key an LWE block. To allow deployments in different scenarios, we demonstrate designs latency-area trade-offs. A compact design uses highly serialized linear-feedback shift register (LFSR) function, while latency-optimized unrolled LFSR parallel datapath. prototype $2^{136}$ challenge-response pairs (CRPs) spartan 6 field-programmable gate array (FPGA). In addition to theoretical guarantee, evaluate empirical resistance various leading ML techniques: prediction error remains above notation="LaTeX">$49.76\%$ after 1 million training CRPs. resource-efficient requires only 45 slices for logic proper, 27 reverse fuzzy extractor. achieves notation="LaTeX">$148X$ reduction latency, at notation="LaTeX">$10X$ increase hardware utilization. mean uniformity responses notation="LaTeX">$49.98\%$ , uniqueness notation="LaTeX">$50.00\%$ reliability notation="LaTeX">$1.26\%$ .